Quantum Flows for Secret Key Distribution

نویسندگان

  • LUIS A. LIZAMA-PÉREZ
  • J. MAURICIO LÓPEZ
  • EDUARDO DE CARLOS LÓPEZ
  • Luis A. Lizama-Pérez
چکیده

In practice, the security of a Quantum Key Distribution (QKD) system relies not only on quantum mechanical principles, but it also significantly relies on the physical implementation of the protocol. Nowadays, technological detector loopholes of QKD systems have been demonstrated, and some successful attacks that exploit vulnerabilities of the Avalanche Photo Diodes (APD’s) have been performed. The ideal quantum scenario has been continuously reduced, thus requiring to enhance QKD to more general protocols that can be device-independent. Recently, it has been shown that faked states attack works successfully on widely used QKD protocols, namely BB84, SARG04, phase-time, DPSK, Ekert protocol and the decoy method. In the QKD protocols published so far, it is defined a single photonic gain because there is an unique qubit class that is used to construct the photonic quantum flow that goes from Alice to Bob. Frequently, the security of a protocol is based on its capability to detect deviations in the photonic gain of the quantum flow in presence of Eve. In contrast, in the ack − QKD protocol, we use two different quantum flows, each one using a multi-qubit state. The multi-qubit is formed by two qubits, so we call it a bi-qubit state. These bi-qubits are chosen in such a way that they are non − orthogonal or parallel states. Let us summarize briefly the ack − QKD protocol: Consider a BB84 based protocol that encodes a classical bit using the four non-orthogonal quantum states: X0, X1, Z0 and Z1. In contrast, in the ack − QKD protocol Alice codifies one classical bit using two quantum states. To distill one secret bit Alice sends two consecutive pulses to Bob who measures them using the same basis measurement (X or Z). In the protocol, such pair of pulses can be non − orthogonal states: (X0, Z0), (X0, Z1), (X1, Z0), (X1, Z1) or parallel states: (X0, X0), (Z0, Z0), (X1, X1), (Z1, Z1). Alice chooses randomly between sending parallel or non − orthogonal states. We argue that the following statements are true:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Flows for Secret Key Distribution in the Presence of the Photon Number Splitting Attack

Physical implementations of quantum key distribution (QKD) protocols, like the Bennett-Brassard (BB84), are forced to use attenuated coherent quantum states, because the sources of single photon states are not functional yet for QKD applications. However, when using attenuated coherent states, the relatively high rate of multi-photonic pulses introduces vulnerabilities that can be exploited by ...

متن کامل

Quantum secret sharing based on a reusable

Reply to Comments on " Quantum Key Distribution for d-level systems for generalized Bell states " [Phys. Rev. A, 052331, (2002)] and " Quantum secret sharing based on a reusable Greenberger-Horne-Zeilinger states as secure carriers " [Phys. Abstract We show that the criticisms of two recent comments [1, 2] on the insecurity of quantum key distributions proposed in [3] and [4] and the secret sha...

متن کامل

Efficient Two-Party Quantum Secret Key-Sharing Protocol

Quantum secret sharing (QSS), quantum secure direct communication, and quantum teleportation, which are all included under quantum key distribution, are used to share or distribute a secure key in a quantum environment. We emphasize cooperation between communicating parties to eliminate un-trustworthy members and to improve the strength of the key.

متن کامل

Special Issue on Entropy-Based Applied Cryptography and Enhanced Security for Ubiquitous Computing

Entropy is a basic and important concept in information theory. It is also often used as a measure of the unpredictability of a cryptographic key in cryptography research areas. Ubiquitous computing (Ubi-comp) has emerged rapidly as an exciting new paradigm. In this special issue, we mainly selected and discussed papers related with ore theories based on the graph theory to solve computational ...

متن کامل

Computational Complexity of Present Schemes of Reverse Reconciliation Continuous Variable Quantum Key Distribution

The continuous variable quantum key distribution has been considered to have the potential to provide high secret key rate. However, in present experimental demonstrations, the secret key can be distilled only under very small loss rates. Here, by calculating explicitly the computational complexity with the channel transmission, we show that under high loss rate it is hard to distill the secret...

متن کامل

Quantum Key Distribution Based On Generating More Than One Secret Bit Per Shared EPR Pair

Given a shared EPR pair, two cooperative parties can obtain one bit of shared secret key by separately measuring the pair along the same basis. Apparently, the Holevo bound [1] suggests that they cannot obtain more than one secret bit per shared EPR pair. Here we show that they can do so by independently putting each of their EPR pairs in a Hilbert subspace which is unknown to the eavesdropper....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013